Efficient Classical Simulation of Slightly Entangled Quantum Computations
نویسندگان
چکیده
منابع مشابه
Efficient classical simulation of slightly entangled quantum computations.
We present a classical protocol to efficiently simulate any pure-state quantum computation that involves only a restricted amount of entanglement. More generally, we show how to classically simulate pure-state quantum computations on n qubits by using computational resources that grow linearly in n and exponentially in the amount of entanglement in the quantum computer. Our results imply that a...
متن کاملClassical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond
The Gottesman-Knill theorem states that every “Clifford” quantum circuit, i.e., a circuit composed of Hadamard, CNOT and phase gates, can be simulated efficiently on a classical computer. It is was later found that a highly restricted classical computer (using only NOT and CNOT gates) suffices to simulate all Clifford circuits, implying that these circuits are most likely even significantly wea...
متن کاملEfficient Classical Simulation of Measurements in Optical Quantum Information
We present conditions for the efficient simulation of a broad class of optical quantum circuits on a classical machine: this class includes unitary transformations, amplification, noise, and measurements. Various proposed schemes for universal quantum computation using optics are assessed against these conditions, and we consider the minimum resource requirements needed in any optical scheme to...
متن کاملEfficient classical simulation of the quantum Fourier transform
A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability of the quantum Fourier transform (QFT). Here we show that one can demonstrate a number of simulability results for QFT circuits in a straightforward manner us...
متن کاملPositive Wigner functions render classical simulation of quantum computation efficient.
We show that quantum circuits where the initial state and all the following quantum operations can be represented by positive Wigner functions can be classically efficiently simulated. This is true both for continuous-variable as well as discrete variable systems in odd prime dimensions, two cases which will be treated on entirely the same footing. Noting the fact that Clifford and Gaussian ope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2003
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.91.147902